UV-diagram: a voronoi diagram for uncertain spatial databases
نویسندگان
چکیده
منابع مشابه
Spatial Density Voronoi Diagram and Construction
To fill a theory gap of Voronoi diagrams that there have been no reports of extended diagrams in spatial density so far. A new concept of spatial density Voronoi diagram was proposed. An important property was presented and proven. And a construction algorithm was presented. Spatial density can be used to indicate factors related to density such as conveyance and the traffic conditions. Some pr...
متن کاملTime - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملRounding Voronoi Diagram
Computational geometry classically assumes real-number arithmetic which does not exist in actual computers. A solution consists in using integer coordinates for data and exact arithmetic for computations. This approach implies that if the results of an algorithm are the input of another, these results must be rounded to match this hypothesis of integer coordinates. In this paper, we treat the c...
متن کاملVoronoi diagram: An adaptive spatial tessellation for processes simulation
Modelling and simulation of spatial processes is increasingly used for a wide variety of applications including water resources protection and management, meteorological prevision and forest fire monitoring. As an example, an accurate spatial modelling of a hydrological system can assist hydrologists to answer questions such as: "where does ground water come from?", “how does it travel through ...
متن کاملVoronoi Diagram for services neighboring a highway
We are given a transportation line where displacements happen at a bigger speed than in the rest of the plane. A shortest time path is a path between two points which takes less than or equal time to any other. We consider the time to follow a shortest time path to be the time distance between the two points. In this paper, we give a simple algorithm for computing the Time Voronoi Diagram, that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The VLDB Journal
سال: 2012
ISSN: 1066-8888,0949-877X
DOI: 10.1007/s00778-012-0290-x